Merkle Tree Traversal Revisited
نویسندگان
چکیده
We propose a new algorithm for computing authentication paths in the Merkle signature scheme. Compared to the best algorithm for this task, our algorithm reduces the worst case running time considerably.
منابع مشابه
Optimal trade-off for merkle tree traversal
In this paper we describe optimal trade-offs between time and space complexity of Merkle tree traversals with their associated authentication paths, improving on the previous results of M. Jakobsson, T. Leighton, S. Micali, and M. Szydlo [Fractal Merkle tree representation and traversal, in: RSA Cryptographers Track, RSA Security Conference, 2003] and M. Szydlo [Merkle tree traversal in log spa...
متن کاملA space- and time-efficient Implementation of the Merkle Tree Traversal Algorithm
We present an algorithm for the Merkle tree traversal problem which combines the efficient space-time trade-off from the fractal Merkle tree [3] and the space efficiency from the improved log space-time Merkle trees traversal [8]. We give an exhaustive analysis of the space and time efficiency of our algorithm in function of the parameters H (the height of the Merkle tree) and h (h = H L where ...
متن کاملMerkle Tree Traversal in Log Space and Time
We present a technique for Merkle tree traversal which requires only logarithmic space and time. For a tree with N leaves, our algorithm computes sequential tree leaves and authentication path data in time 2 log 2 (N) and space less than 3 log 2 (N), where the units of computation are hash function evaluations or leaf value computations, and the units of space are the number of node values stor...
متن کاملFractal Merkle Tree Representation and Traversal
We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For one choice of parameters, and a total of N leaves, our technique requires a worst-case computational effort of 2 log N/loglog N hash function evaluations per output, and a total storage capacity of less than 1.5 log ...
متن کاملSlightly Improved Merkle Tree Traversal for User Authentication Using Pseudorandomly-Generated Leaves
Merkle trees can be used for a variety of cryptographic purposes, including digital signatures and user authentication. We describe a technique for pseudorandomly generating the private values corresponding to the leaves of a Merkle tree from a common seed. The technique allows for secure user authentication with fewer hash function evaluations required to generate the authentication data. Usin...
متن کامل